Using the No-Search Easy-Hard Technique for Downward Collapse
نویسندگان
چکیده
Σ k Π k DIFFm(Σ p k ) coDIFFm(Σ p k ) P Σ p k m-tt P Σ p k m+1-tt BH(Σ k ) Supported in part by grants NSF-CCR-9322513, NSF-INT-9513368/DAAD-315-PRO-fo-ab, and NSF-INT9815095/DAAD-315-PPP-gü-ab, and a NATO Postdoctoral Science Fellowship from the DAAD’s “Gemeinsames Hochschulsonderprogramm III von Bund und Ländern” program. This report combines and extends each of technical reports corr-cs.CC/9808002 and corr-cs.CC/9910008. Email: [email protected]. Work done in part while visiting Friedrich-Schiller-Universität and Julius-MaximiliansUniversität. Email: [email protected]. Work done in part while visiting Friedrich-Schiller-Universität and JuliusMaximilians-Universität. Email: [email protected]. Work done in part while visiting Le Moyne College, and while visiting the University of Rochester under a NATO Postdoctoral Science Fellowship from the DAAD.
منابع مشابه
Proposing a Constrained-GSA for the Vehicle Routing Problem
In the past decades, vehicle routing problem (VRP) has gained considerable attention for its applications in industry, military, and transportation applications. Vehicle routing problem with simultaneous pickup and delivery is an extension of the VRP. This problem is an NP-hard problem; hence finding the best solution for this problem which is using exact method, take inappropriate time, and th...
متن کاملHouse Price Rigidity and the Asymmetric Response of Housing Prices to Monetary Policy in Iran
This paper examines downward price rigidity in Iranian house market and discusses whether this characteristic would result in an asymmetric relationship between house price and monetary policy. To test the downward house price rigidity the threshold GARCH model is employed. The asymmetric adjustment to monetary policy is examined using the asymmetric cointegration and error correction models. T...
متن کاملIn Search of an Easy Witness: Exponential Time vs. Probabilistic Polynomial Time
Restricting the search space f gn to the set of truth tables of easy Boolean functions on logn variables as well as using some known hardness randomness tradeo s we establish a number of results relating the complexity of exponential time and probabilistic polynomial time complexity classes In particular we show that NEXP P poly NEXP MA this can be interpreted as saying that no derandomization ...
متن کاملAn Improved K-Nearest Neighbor with Crow Search Algorithm for Feature Selection in Text Documents Classification
The Internet provides easy access to a kind of library resources. However, classification of documents from a large amount of data is still an issue and demands time and energy to find certain documents. Classification of similar documents in specific classes of data can reduce the time for searching the required data, particularly text documents. This is further facilitated by using Artificial...
متن کاملAN EASY SOLUTION FOR THE DIVERTING LOOP COLOSTOMY: OUR TECHNIQUE
ABSTRACT Background: The loop colostomy is one of the most popular techniques used as a protective maneuver for a distal anastomosis and/or temporary fecal diversion. We are introducing the use of a full thickness skin bridge under the large bowel instead of a glass rod which alleviates problems such as protrusion of the large bowel, retraction of the bowel into the abdomen after removing the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره cs.CC/0106037 شماره
صفحات -
تاریخ انتشار 2001